Efficient Scheduling for Design Exploration with Imprecise Latency and Register Constraints
نویسندگان
چکیده
In archiectural synthesis, scheduling and resource allocation are important steps. During the early stage of the design, imprecise information is unavoidable. Under the imprecise system characteristics and constraints, this paper proposes a polynomial-time scheduling algorithm which minimizes both functional units and registers while scheduling. The algorithm can be used in design exploration for exploring the tradeoff between latency and register counts and selecting a solution with satisfactory performance and cost. The experiments show that we can achieve a schedule with the same acceptable degree while saving register upto 37% compared to the traditional algorithm.
منابع مشابه
Dealing with Imprecise Timing Information in Architectural Synthesis
In this paper, we propose a framework for design exploration in architectural synthesis which takes imprecise timing information into account. Impreciseness in the architectural synthesis usually exists due to the lack of the exact knowledge about components which have not been completely designed down to the geometric level or due to manufacturing variances. Based on the fuzzy theory, we desig...
متن کاملSINGLE MACHINE DUE DATE ASSIGNMENT SCHEDULING PROBLEM WITH PRECEDENCE CONSTRAINTS AND CONTROLLABLE PROCESSING TIMES IN FUZZY ENVIRONMENT
In this paper, a due date assignment scheduling problem with precedence constraints and controllable processing times in uncertain environment is investigated, in which the basic processing time of each job is assumed to be the symmetric trapezoidal fuzzy number, and the linear resource consumption function is used.The objective is to minimize the crisp possibilistic mean (or expected) value of...
متن کاملProject scheduling optimization for contractor’s Net present value maximization using meta-heuristic algorithms: A case study
Today's competitive conditions have caused the projects to be carried out in the least possible time with limited resources. Therefore, managing and scheduling a project is a necessity for the project. The timing of a project is to specify a sequence of times for a series of related activities. According to their priority and their latency, so that between the time the project is completed and ...
متن کاملDomain-specific Design Space Exploration and Variant Selection Methods for High-performance Cryptographic Engines
We present an generator-based approach for efficient design space exploration and high-level synthesis of cryptographic designs. It allows the directed search for new algorithmic variants. The approach combines high-level synthesis features like automated scheduling and allocation with performance considerations down to the register-level which are crucial for the performance of cryptographic d...
متن کامل